Adaptive routing on parallel computing structures

Adaptive data parallel computing on workstation clusters

Many real world problems can be categorised under the data parallel programming paradigm. Such problems can be solved in the workstation cluster environment, which is fast becoming a viable platform for parallel computing, by allocating each node a portion of data proportional to its computational capability. In the workstation cluster environment, workstations may be recalled by their primary ...

Towards Autonomic Computing: Adaptive Job Routing

Compact Distributed Data Structures for Adaptive Routing

In designing a routing scheme for a communication network it is desirable to use as short as possible paths for routing messages, while keeping the routing information stored in the processors' local memory as succinct as possible. The eeciency of a routing scheme is measured in terms of its stretch factor-the maximum ratio between the cost of a route computed by the scheme and that of a cheape...

Control Structures for Parallel Computing in NUT

Specification language of NUT has been recently extended with functions for distributed computing. This extension can be used for developing a collection of control structures for parallel compositional programming. The purpose of this thesis is to support distributed and coarse grained parallel computing in the NUT system, on the basis of the rNUT distributed programming toolkit. This work con...

Adaptive Data Parallel Computing on Workstation Clusters 3